Wavelet Frames,Sobolev Embeddings and Negative Spectrum of Schrödinger Operators on Manifolds with Bounded Geometry

We consider weighted function spaces of Sobolev-Besov type and Schrödinger type operators on noncompact Riemannian manifolds with bounded geometry. First we give characterization of the spaces in terms of wavelet frames. Then we describe the necessary and sufficient conditions for the compactness of Sobolev embeddings between the spaces. An asymptotic behavior of the corresponding entropy numbers is calculated. At the end we use the asymptotic behavior to estimate the number of negative eigenvalues of the Schrödinger type operators.     

Approximating stationary points of stochastic optimization problems in Banach space

In this paper, we present a uniform strong law of large numbers for random set-valued mappings in separable Banach space and apply it to analyze the sample average approximation of Clarke stationary points of a nonsmooth one stage stochastic minimization problem in separable Banach space. Moreover, under Hausdorff continuity, we show that with probability approaching one exponentially fast with the increase of sample size, the sample average of a convex compact set-valued mapping converges to its expected value uniformly. The result is used to establish exponential convergence of stationary sequence under some metric regularity conditions.     

Nondeterminism of Linear Operators and Lower Entropy Estimates

Let u be a (bounded, linear) operator from a Hilbert space ℋ into the Banach space C(T), the space of continuous functions on the compact metric space T. We introduce and investigate numbers τ _n (u), n≥1, measuring the degree of determinism of the operator u. The slower τ _n (u) decreases, the less determined are functions in the range of u by their values on a certain set of points. It is shown that n ^−1/2 τ _n (u)≤2e _n (u), where e _n (u) are the (dyadic) entropy numbers of u. Furthermore, we transform the notion of strong local nondeterminism from the language of stochastic processes into that of linear operators. This property, together with a lower entropy estimate for the compact space T, leads to a lower estimate for τ _n (u), hence also for e _n (u). These results are used to prove sharp lower entropy estimates for some integral operators, among them, Riemann–Liouville operators with values in C(T) for some fractal set T. Some multi-dimensional extensions are treated as well.      

模糊值函数分析学的结构元方法简介(Ⅰ)——结构元与模糊数运算

简述了模糊值函数分析学在具体工程实践应用中存在的困难和障碍,系统地介绍了模糊结构元方法在模糊值函数分析学中的应用,包括模糊结构元的概念、模糊数的模糊结构元表示形式、基于结构元表达形式的模糊数运算与隶属函数确定.模糊结构元方法将复杂的模糊数运算转化为一类单调有界函数的运算,不仅仅为模糊分析计算的简化提供了工具,同时也为模糊值函数分析学应用的研究开创了一条新的途径.     

关于自然数幂和的两个改进不等式

应用分析的方法得到了关于自然数幂和的两个改进不等式,并证明了有关的四个常数均为最佳值.     

Enumerating split-pair arrangements

An arrangement of the multi-set {1,1,2,2,…,n,n} is said to be “split-pair” if for all i<n, between the two occurrences of i there is exactly one i+1. We enumerate the number of split-pair arrangements and in particular show that the number of such arrangements is (−1)ⁿ⁺¹n²(²2n−1)B2n where Bi is the ith Bernoulli number.     

Limiting theorems for the nodes in binary search trees

We consider three random variables X_n, Y_n and Z_n, which represent the numbers of the nodes with 0, 1, and 2 children, in the binary search trees of size n. The expectation and variance of the three above random variables are got, and it is also shown that X_n, Y_n and Z_n are all asymptotically normal as n→∞by applying the contraction method.     

A note on lattice chains and Delannoy numbers

Fix nonnegative integers n₁,…,n_d and let L denote the lattice of integer points (a₁,…,a_d)∈Z^d satisfying 0?a_i?n_i for 1?i?d. Let L be partially ordered by the usual dominance ordering. In this paper we offer combinatorial derivations of a number of results concerning chains in L. In particular, the results obtained are established without recourse to generating functions or recurrence relations. We begin with an elementary derivation of the number of chains in L of a given size, from which one can deduce the classical expression for the total number of chains in L. Then we derive a second, alternative, expression for the total number of chains in L when d=2. Setting n₁=n₂ in this expression yields a new proof of a result of Stanley [Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999] relating the total number of chains to the central Delannoy numbers. We also conjecture a generalization of Stanley's result to higher dimensions.     

On optimal binary signed digit representations of integers

Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is and how to generate them entirely. We also show which kinds of integers have the maximum number of optimal BSD-Rs.